Lower Bounds of Functional Mean Code Word Length in Fuzzy Set
نویسندگان
چکیده
منابع مشابه
On generalized fuzzy mean code word lengths
In present communication, a generalized fuzzy mean code word length of degree β has been defined and its bounds in the term of generalized fuzzy information measure have been studied. Further we have defined the fuzzy mean code word length of type α, β and its bounds have also been studied. Monotonic behavior of these fuzzy mean code word lengths have been illustrated graphically by taking some...
متن کاملQuantum lower bounds of set equality problems
The set equality problem is to decide whether two sets given by functions a and b such that A = {a(1), a(2), ..., a(n)} and B = {b(1), b(2), ..., b(n)} are equal or disjoint, under the promise that one of these is the case. Some other problems, like the Graph Isomorphism problem, is solvable by reduction to the set equality problem. This motivates to find a polynomial quantum lower bound for th...
متن کاملLower Bounds for Synchronizing Word Lengths in Partial Automata
It was conjectured by \v{C}ern\'y in 1964, that a synchronizing DFA on $n$ states always has a synchronizing word of length at most $(n-1)^2$, and he gave a sequence of DFAs for which this bound is reached. Until now a full analysis of all DFAs reaching this bound was only given for $n \leq 4$, and with bounds on the number of symbols for $n \leq 10$. Here we give the full analysis for $n \leq ...
متن کاملLower bounds for Morse index of constant mean curvature tori
In the paper, three lower bounds are given for the Morse index of a constant mean curvature torus in Euclidean 3-space, in terms of its spectral genus g. The first two lower bounds grow linearly in g and are stronger for smaller values of g, while the third grows quadratically in g but is weaker for smaller values of g.
متن کاملLower Bounds on Same-Set Inner Product in Correlated Spaces
Let P be a probability distribution over a finite alphabet Ω with all ` marginals equal. Let X(1), . . . , X(`), X(j) = (X 1 , . . . , X (j) n ) be random vectors such that for every coordinate i ∈ [n] the tuples (X i , . . . , X (`) i ) are i.i.d. according to P. The question we address is: does there exist a function cP() independent of n such that for every f : Ω → [0, 1] with E[f(X(1))] = μ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Research in Applied Science and Engineering Technology
سال: 2021
ISSN: 2321-9653
DOI: 10.22214/ijraset.2021.32951